Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
نویسندگان
چکیده
We present a method for solving the transshipment problem---also known as uncapacitated minimum cost flow---up to multiplicative error of $ 1 + \varepsilon in undirected graphs with nonnegative...
منابع مشابه
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
We present a method for solving the transshipment problem—also known as uncapacitated minimum cost flow—up to a multiplicative error of 1 + in undirected graphs with polynomially bounded integer edge weights using a tailored gradient descent algorithm. An important special case of the transshipment problem is the single-source shortest paths (SSSP) problem. Our gradient descent algorithm takes ...
متن کاملNear-shortest and K-shortest simple paths
We describe a new algorithm for solving the problem of enumerating all nearshortest simple (loopless) s-t paths in a graph G = (V,E) with non-negative edge lengths. Letting n = |V | and m = |E|, the time per path enumerated is O(nS(n,m)) given a user-selected shortest-path subroutine with complexity O(S(n,m)). When coupled with binary search, this algorithm solves the corresponding K-shortest s...
متن کاملApproximate Shortest Descending Paths
We present an approximation algorithm for the shortest descending path problem. Given a source s and a destination t on a terrain, a shortest descending path from s to t is a path of minimum Euclidean length on the terrain subject to the constraint that the height decreases monotonically as we traverse that path from s to t. Given any ε ∈ (0, 1), our algorithm returns in O(n log(n/ε)) time a de...
متن کاملApproximate Shortest Homotopic Paths in Weighted Regions
Let P be a path between two points s and t in a polygonal subdivision T with obstacles and weighted regions. Given a relative error tolerance ε ∈ (0, 1), we present the first algorithm to compute a path between s and t that can be deformed to P without passing over any obstacle and the path cost is within a factor 1+ ε of the optimum. The running time is O( 3 ε2 knpolylog(k, n, 1 ε )), where k ...
متن کاملApproximate shortest paths in weighted graphs
We present an approximation algorithm for the all pairs shortest paths (APSP) problem in weighed graphs. Our algorithm solves the APSP problem for weighted directed graphs, with real (positive or negative) weights, up to an additive error of . For any pair of vertices u, v, the algorithm finds a path whose length is at most δ(u, v) + . The algorithm is randomized and runs in Õ(n) < O(n) time, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2021
ISSN: ['1095-7111', '0097-5397']
DOI: https://doi.org/10.1137/19m1286955